Decision and Search in Non-Abelian Cramer-Shoup Public Key Cryptosystem

Decision and Search in Non-abelian Cramer Shoup Public Key Cryptosystem

The field of combinatorial group theory began with decision problems of Max Dehn from 1912, known as the word problem, the conjugacy problem and the isomorphism problem. These fields have developed close connections to topology, logic and computer science. Word problem: Let G be a group given by a finite presentation. Does there exist an algorithm to determine if an arbitrary word w in the gene...

New Public Key Cryptosystem Using Finite Non Abelian Groups

Most public key cryptosystems have been constructed based on abelian groups up to now. We propose a new public key cryptosystem built on finite non abelian groups in this paper. It is convertible to a scheme in which the encryption and decryption are much faster than other well-known public key cryptosystems, even without no message expansion. Furthermore a signature scheme can be easily derive...

Improved Public Key Cryptosystem using Finite non Abelian Groups

Public key cryptosystem and a key exchange protocol using tools of non-abelian group

Abstract. Public Key Cryptosystems assure privacy as well as integrity of the transactions between two parties. The sizes of the keys play an important role. The larger the key the harder is to crack a block of encrypted data. We propose a new public key cryptosystem and a Key Exchange Protocol based on the generalization of discrete logarithm problem using Non-abelian group of block upper tria...

A Public Key Encryption In Standard Model Using Cramer-Shoup Paradigm

We present a public-key encryption scheme which is provably secure against adaptive chosen ciphertext attack. The scheme is constructed using Cramer-Shoup paradigm [7]. The security of the scheme is based on the Decisional Bilinear Diffie-Hellman problem.